Skip to content

Conversation

H0p1ty
Copy link

@H0p1ty H0p1ty commented Feb 24, 2024

an actual pull request


TEST(TopologySort, Simple) {
ASSERT_EQ(1, 1); // Stack []
std::pair<int, int> solution(int number, std::vector<int> v) {
Copy link
Contributor

Choose a reason for hiding this comment

The reason will be displayed to describe this comment to others. Learn more.

вынеси в отдельный файл

Copy link
Author

Choose a reason for hiding this comment

The reason will be displayed to describe this comment to others. Learn more.

Сделано

@@ -0,0 +1,19 @@
#include <vector>
//#include <priority_queue>
Copy link
Contributor

Choose a reason for hiding this comment

The reason will be displayed to describe this comment to others. Learn more.

это наверное нужно утащить в другой ПР со вторым заданием

indices_map
.end()) { // if key "number - t" exists, we have found the solution
return {indices_map[sum - v[i]], i};
flag = true;
Copy link
Contributor

Choose a reason for hiding this comment

The reason will be displayed to describe this comment to others. Learn more.

а давай подумаем, мы сюда когда-нибудь попадем?)

Sign up for free to join this conversation on GitHub. Already have an account? Sign in to comment
Labels
None yet
Projects
None yet
Development

Successfully merging this pull request may close these issues.

2 participants